Properties of Languages with Catenation and Shuffle

نویسندگان

  • Nils Erik Flick
  • Manfred Kudlek
چکیده

We present finite automata for shuffle languages, iteration lemmata for languages with catenation and shuffle, closure properties of such language classes, as well as decidability results.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Hierarchy of Languages with Catenation and Shuffle

We present basic structures, definitions, normal forms, and a hierarchy of languages based on catenation, shuffle and their iterations, defined by algebraic closure or least fix point solution of systems of equations.

متن کامل

Contextual Grammars with Distributed Catenation and Shuffle

We introduce a new type of contextual grammars. Instead of considering the catenation operation we use the distributed catenation operation. The contexts are distributed catenated with words from the language, de ning in this way new words from the language. We investigate several properties of the languages generated by distributed catenated contextual grammars. Finally, we also present the re...

متن کامل

Languages Generated Using an Abstract Catenation

We present some results regarding languages that are context-free or regular w.r.t. a non-deterministic binary operation on words that is left variable, only asking a few general properties like associativity. This could be part of a unified approach to intertextuality, the results referring, in particular, to important instances of ”putting texts together” operations like concatenation and shu...

متن کامل

On the Generative Capacity of Contextual Grammars with Catenation. Necessary Conditions

In this paper our attention is focused on the study of the properties for some families of contextual languages with catenation (see Fortiş, 1999, also Păun, 1982; Păun, 1997). Also, we are defining and analyzing some new properties characteristic to these families of languages. Using these properties we are able to establish some necessary conditions, and some pumping properties for families o...

متن کامل

Generating the Pseudo-Powers of a Word

The notions of power of word, periodicity and primitivity are intrinsically connected to the operation of catenation, that dynamically generates word repetitions. When considering generalizations of the power of a word, other operations will be the ones that dynamically generate such pseudo-repetitions. In this paper we define and investigate the operation of θ-catenation that gives rise to the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Fundam. Inform.

دوره 129  شماره 

صفحات  -

تاریخ انتشار 2012